翻訳と辞書 Words near each other ・ Declan Bree ・ Decision problem ・ Decision rule ・ Decision Sciences ・ Decision Sciences Institute ・ Decision Sciences Journal of Innovative Education ・ Decision stump ・ Decision Support Panel ・ Decision support system ・ Decision table ・ Decision Theater ・ Decision theology ・ Decision theory ・ Decision tree ・ Decision tree learning ・ Decision tree model ・ Decision-making ・ Decision-making models ・ Decision-making paradox ・ Decision-making software ・ Decision-matrix method ・ Decision-theoretic rough sets ・ Decision-to-decision path ・ Decisional balance sheet ・ Decisional composite residuosity assumption ・ Decisional Diffie–Hellman assumption ・ DecisionDx-UM ・ Decisiones ・ Decisiones Extremas ・ Decisionism Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Decision tree model ： ウィキペディア英語版 Decision tree model In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an algorithm or communication process is considered to be basically a decision tree, i.e., a sequence of branching operations based on comparisons of some quantities, the comparisons being assigned the unit computational cost. The branching operations are called "tests" or "queries". In this setting the algorithm in question may be viewed as a computation of a Boolean function $f:\; \backslash ^n\; \backslash rightarrow\; \backslash$ where the input is a series of queries and the output is the final decision. Every query is dependent on previous queries. Several variants of decision tree models have been introduced, depending on the complexity of the operations allowed in the computation of a single comparison and the way of branching. Decision trees models are instrumental in establishing lower bounds for computational complexity for certain classes of computational problems and algorithms: the lower bound for worst-case computational complexity is proportional to the largest depth among the decision trees for all possible inputs for a given computational problem. The computation complexity of a problem or an algorithm expressed in terms of the decision tree model is called decision tree complexity or query complexity. ==Classification by query computational complexity== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Decision tree model」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.